On string functions and double-sum formulas

نویسندگان

چکیده

String functions are important building blocks of characters integrable highest modules over affine Kac--Moody algebras. Kac and Peterson computed string for Lie algebras type $A_{1}^{(1)}$ in terms Dedekind eta functions. We produce new relations between by writing them as double-sums then using certain symmetry relations. evaluate the series special double-sum formulas that express Hecke-type Appell--Lerch theta functions, where we point out Ramanujan's classical mock

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Sum relations for multiple zeta values and connection formulas for the Gauss hypergeometric functions

We give an explicit representation for the sums of multiple zetastar values of fixed weight and height in terms of Riemann zeta values.

متن کامل

On Symplectic Sum Formulas in Gromov-Witten Theory: an Update

This note describes the changes made in the second arXiv version of [FZ0] relative to the first. It also summarizes the contributions of and issues with [IP4], [IP5], and [LR]. The only differences with the 12/28/14 update are in (IP4p2) and (IP4p3).

متن کامل

Belief Functions on Formulas in Lukasiewicz Logic

Belief functions are generalized to formulas in Lukasiewicz logic. It is shown that they generalize probabilities on formulas (so-called states) and that they are completely monotone mappings with respect to the lattice operations.

متن کامل

Sum of Products of Read-Once Formulas

We study limitations of polynomials computed by depth two circuits built over read-once formulas (ROFs). In particular, 1. We prove an exponential lower bound for the sum of ROFs computing the 2n-variate polynomial in VP defined by Raz and Yehudayoff [CC,2009]. 2. We obtain an exponential lower bound on the size of arithmetic circuits computing sum of products of restricted ROFs of unbounded de...

متن کامل

Some Asymptotic Formulas on Generalized Divisor Functions

1 . Throughout this paper, we use the following notation : c•1 , c2 , . . ., X0 , X1 , . . . denote positive absolute constants. We denote the number of elements of the finite set S by BSI . We write ex =exp (x) . We denote the least prime factor of n by p(n) . We write pall n if pain but pa+1 f n . v(n) denotes the number of the distinct prime factors of n, while the number of all the prime fa...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Research in the Mathematical Sciences

سال: 2023

ISSN: ['2522-0144', '2197-9847']

DOI: https://doi.org/10.1007/s40687-023-00379-x